A Search Procedure for Perfect Information Games of Chance: Its Formulation and Analysis
نویسنده
چکیده
An algorithm i s developed for searching the trees of "perfect information" games involving chance events. Many dice games (e.g. backgammon, craps, and monopoly and similar board games), and some card games (e.g. casino blackjack), have this property. For depth 3 trees, empirical observation reveals a search reduction of more than 50 percent, while closed-form analysis reveals a best-case complexity of O(N**2) a substantial savings over This represents the O(N**3) behavior of the "obvious" search strategy.
منابع مشابه
Dynamic system of strategic games
Maybe an event can't be modeled completely through one game but there is more chance with several games. With emphasis on players' rationality, we present new properties of strategic games, which result in production of other games. Here, a new attitude to modeling will be presented in game theory as dynamic system of strategic games and its some applications such as analysis of the clash betwe...
متن کاملMonte-Carlo Tree Reductions for Stochastic Games
Monte-Carlo Tree Search (MCTS) is a powerful paradigm for perfect information games. When considering stochastic games, the tree model that represents the game has to take chance and a huge branching factor into account. As effectiveness of MCTS may decrease in such a setting, tree reductions may be useful. Chance-nodes are a way to deal with random events. Move-groups are another way to deal e...
متن کاملTowards a Characterization of Chance in Games The Case of Two-Player Zero-Sum Games with Perfect Information
The distinction between games of chance and games of skill is not well-defined at present. We introduce the concept of chanciness for non-deterministic two-player zero-sum games with sequential moves and perfect information. chanciness quantifies how strongly a game is influenced by chance events. We demonstrate that the relative influence of chance on game outcomes varies with the skill of the...
متن کاملA Finite Volume Formulation for the Elasto-Plastic Analysis of Rectangular Mindlin-Reissner Plates, a Non-Layered Approach
This paper extends the previous work of authors and presents a non-layered Finite Volume formulation for the elasto-plastic analysis of Mindlin-Reissner plates. The incremental algorithm of the elasto-plastic solution procedure is shown in detail. The performance of the formulation is examined by analyzing of plates with different boundary conditions and loading types. The results are illustrat...
متن کاملFinding Equilibria in Games of No Chance
We consider finding maximin strategies and equilibria of explicitly given extensive form games with imperfect information but with no moves of chance. We show: 1. A maximin pure strategy for a two-player extensive form game with perfect recall and no moves of chance can be found in time linear in the size of the game tree. In contrast, it is known that this problem is NP-hard for games with cha...
متن کامل